Research in Graph Signal Processing (GSP) aims to develop tools for processing data defined on irregular graph domains. In this paper we first provide an overview of core ideas in GSP and their connection to conventional digital signal processing, along with a brief historical perspective to highlight how concepts recently developed in GSP build on top of prior research in other areas. We then summarize recent advances in developing basic GSP tools, including methods for sampling, filtering or graph learning. Next, we review progress in several application areas using GSP, including processing and analysis of sensor network data, biological data, and applications to image processing and machine learning.

This paper presents a corpus annotated for the task of direct-speech extraction in Croatian. The paper focuses on the annotation of the quotation, co-reference resolution, and sentiment annotation in SETimes news corpus in Croatian and on the analysis of its language-specific differences compared to English. From this, a list of the phenomena that require special attention when performing these annotations is derived. The generated corpus with quotation features annotations can be used for multiple tasks in the field of Natural Language Processing.

Nonconvex optimization is central in solving many machine learning problems, in which block-wise structure is commonly encountered. In this work, we propose cyclic block coordinate methods for nonconvex optimization problems with non-asymptotic gradient norm guarantees. Our convergence analysis is based on a gradient Lipschitz condition with respect to a Mahalanobis norm, inspired by a recent progress on cyclic block coordinate methods. In deterministic settings, our convergence guarantee matches the guarantee of (full-gradient) gradient descent, but with the gradient Lipschitz constant being defined w.r.t.~the Mahalanobis norm. In stochastic settings, we use recursive variance reduction to decrease the per-iteration cost and match the arithmetic operation complexity of current optimal stochastic full-gradient methods, with a unified analysis for both finite-sum and infinite-sum cases. We further prove the faster, linear convergence of our methods when a Polyak-{\L}ojasiewicz (P{\L}) condition holds for the objective function. To the best of our knowledge, our work is the first to provide variance-reduced convergence guarantees for a cyclic block coordinate method. Our experimental results demonstrate the efficacy of the proposed variance-reduced cyclic scheme in training deep neural nets.

Media has a substantial impact on the public perception of events. A one-sided or polarizing perspective on any topic is usually described as media bias. One of the ways how bias in news articles can be introduced is by altering word choice. Biased word choices are not always obvious, nor do they exhibit high context-dependency. Hence, detecting bias is often difficult. We propose a Transformer-based deep learning architecture trained via Multi-Task Learning using six bias-related data sets to tackle the media bias detection problem. Our best-performing implementation achieves a macro $F_{1}$ of 0.776, a performance boost of 3\% compared to our baseline, outperforming existing methods. Our results indicate Multi-Task Learning as a promising alternative to improve existing baseline models in identifying slanted reporting.

元梯度方法（Xu等，2018； Zahavy等，2020）为非平稳加强学习问题中的超参数选择和适应性提供了有希望的解决方案。但是，尚未系统地研究此类环境中元梯度的特性。在这项工作中，我们在非平稳环境中对元级别的新清晰度进行了新的清晰度。具体而言，我们问：（i）应向学习的优化者提供多少信息，以使一生中更快地适应和概括，（ii）在此过程中学习了什么元访问功能，以及（iii）是否）元梯度方法在高度非平稳的环境中提供了更大的优势。为了研究提供给元淘汰的信息的影响，如最近的作品（Flennerhag等，2021; Almeida等，2021），我们用学识渊博的元参数功能替换了固定更新规则的调谐元参数选定的上下文功能。上下文功能携带有关代理性能和环境变化的信息，因此可以告知学习的元参数计划。我们发现，添加更多的上下文信息通常是有益的，从而导致元参数值更快地适应并在一生中提高绩效。我们通过对结果的元参数计划和上下文特征的学习功能进行定性分析来支持这些结果。最后，我们发现没有上下文，在高度非平稳的环境中，元梯度并不能比基线提供一致的优势。我们的发现表明，情境化的元梯度可以在非平稳设置中的元梯度中提取高性能方面发挥关键作用。

航空图像访问和数量的最新增加，计算能力的增加以及对应用的兴趣为扩大对象检测和域适应研究的范围打开了大门。航空数据集的大小非常大，数据集的每个帧都包含大量密集和小物体。由于缺乏培训数据，因此对航空影像的深度学习应用是落后的，并且研​​究人员最近转向了从标记的数据集到未标记的数据集以减轻问题的域名适应（DA）。这些因素构成了两个主要挑战：数据集之间的高品种（例如，对象大小，类别分布，对象特征统一性，图像获取，距离，天气条件），以及卫星图像中对象的大小以及随后的最先进的失败 - 用于捕获卫星图像中密集重叠对象的小物体，本地特征和区域建议。在本文中，我们建议解决这些问题的两种解决方案：一个域歧视器，以更好地对齐域之间的本地特征空间；以及一条新型的管道，通过空间金字塔池，跨阶段部分网络，基于热图的区域建议以及通过新颖的图像难度评分来改善对象的定位和识别，从而改善了后端，从而改善了基于整体焦点损失衡量标准的对象定位和识别。在图像难度上。我们提出的模型的表现优于最新方法7.4％。

We study stochastic monotone inclusion problems, which widely appear in machine learning applications, including robust regression and adversarial learning. We propose novel variants of stochastic Halpern iteration with recursive variance reduction. In the cocoercive -- and more generally Lipschitz-monotone -- setup, our algorithm attains $\epsilon$ norm of the operator with $\mathcal{O}(\frac{1}{\epsilon^3})$ stochastic operator evaluations, which significantly improves over state of the art $\mathcal{O}(\frac{1}{\epsilon^4})$ stochastic operator evaluations required for existing monotone inclusion solvers applied to the same problem classes. We further show how to couple one of the proposed variants of stochastic Halpern iteration with a scheduled restart scheme to solve stochastic monotone inclusion problems with ${\mathcal{O}}(\frac{\log(1/\epsilon)}{\epsilon^2})$ stochastic operator evaluations under additional sharpness or strong monotonicity assumptions.

本文考虑了在动态环境中的异质治疗效果的推断，可协变量和治疗是纵向的。我们专注于样本大小，$ N $的高维病例可能比协变量矢量的维度，$ D $。考虑了边缘结构平均模型。我们提出了一种基于“时刻有针对性”滋扰估计的“顺序模型双重稳健”估计器。这些滋扰估算器经过非标准损耗函数精心设计，从而减少了由潜在的模型误操作造成的偏差。即使发生模型拼写，我们也可以实现$ \ sqrt n $-incerence。我们只需要在每个时间点正确指定一个滋扰模型。这种模型正确性条件比所有现有的工作较弱，甚至含有低维度的文献。

我们在大规模设置中研究一类广义的线性程序（GLP），包括可能简单的非光滑凸规律器和简单的凸集合约束。通过将GLP作为等效凸凹入最大问题的重新介绍，我们表明问题中的线性结构可用于设计高效，可扩展的一阶算法，我们给出了名称\ EMPH {坐标线性方差减少}（\ textsc {clvr};发音为``clever''）。 \ textsc {clvr}是一种增量坐标方法，具有隐式方差差异，输出双变量迭代的\ emph {仿射组合}。 \ textsc {clvr}产生改善的复杂性结果（glp），这取决于（glp）中的线性约束矩阵的最大行标准而不是光谱标准。当正常化术语和约束是可分离的，\ textsc {clvr}承认有效的延迟更新策略，使其复杂性界限与（glp）中的线性约束矩阵的非零元素的数量而不是矩阵尺寸。我们表明，通过引入稀疏连接的辅助变量，可以将基于$ F $ -divergence和Wassersein指标的歧义组的分布稳健优化（DRO）问题进行重新重整为（GLP）。我们补充了我们的理论保证，具有验证我们算法的实际效果的数值实验，无论是在壁钟时间和数据次数方面。

Maternal and child mortality is a public health problem that disproportionately affects low-and middle-income countries. Every day, 800 women and 6,700 newborns die from complications related to pregnancy or childbirth. And for every maternal death, about 20 women suffer serious birth injuries. However, nearly all of these deaths and negative health outcomes are preventable. Midwives are key to revert this situation, and thus it is essential to strengthen their capacities and the quality of their education. This is the aim of the Safe Delivery App, a digital job aid and learning tool to enhance the knowledge, confidence and skills of health practitioners. Here, we use the behavioral logs of the App to implement a recommendation system that presents each midwife with suitable contents to continue gaining expertise. We focus on predicting the click-through rate, the probability that a given user will click on a recommended content. We evaluate four deep learning models and show that all of them produce highly accurate predictions.